Community Detection Through Optimal Density Contrast of Adjacency Matrix
نویسندگان
چکیده
منابع مشابه
Community Detection Through Optimal Density Contrast of Adjacency Matrix
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is designed to detect community. Since the relabeling of nodes does not alter the topology of the network, the problem of community detection corresponds to the finding of a good labeling of nodes so that the adjacency matrix...
متن کاملChromosome Representation through Adjacency Matrix in Evolutionary Circuits Synthesis
The use of adjacency matrices to the chromosome coding in evolutionary circuits techniques is proposed. The approach is shown to overcome some of the drawbacks associated with other coding schemes simplifying the implementation of the evolution process. It is particularly shown that the proposed coding scheme reduces considerably the generation of anomalous circuits increasing the efficiency of...
متن کاملOn the Inverse of Forward Adjacency Matrix
During routine state space circuit analysis of an arbitrarily connected set of nodes representing a lossless LC network, a matrix was formed that was observed to implicitly capture connectivity of the nodes in a graph similar to the conventional adjacency matrix, but in a slightly different manner. This matrix has only 0, 1 or -1 as its elements. A sense of direction (of the graph formed by the...
متن کاملTHE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملReducing the Adjacency Matrix of a Tree
Let T be a tree, A its adjacency matrix, and a scalar. We describe a linear-time algorithm for reducing the matrix In +A. Applications include computing the rank of A, nding a maximum matching in T , computing the rank and determinant of the associated neighborhood matrix, and computing the characteristic polynomial of A.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatica
سال: 2011
ISSN: 0868-4952,1822-8844
DOI: 10.15388/informatica.2011.318